Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars
نویسندگان
چکیده
Predictive shift-reduce (PSR) parsing for a subclass of hyperedge replacement graph grammars has recently been devised by Frank Drewes and the authors [6]. This paper describes in detail how efficient PSR parsers are generated with the Grappa parser generator implemented by Mark Minas. Measurements confirm that the generated parsers run in linear time.
منابع مشابه
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
Graph languages defined by hyperedge replacement grammars can be NP-complete. We study predictive shift-reduce (PSR) parsing for a subclass of these grammars, which generalizes the concepts of SLR(1) string parsing to graphs. PSR parsers run in linear space and time. In comparison to the predictive top-down (PTD) parsers recently developed by the authors, PSR parsing is more efficient and more ...
متن کاملApproximating Parikh Images for Generating Deterministic Graph Parsers
The Parikh image of a word abstracts from the order of its letters. Parikh’s famous theorem states that the set of Parikh images of a context-free string language forms a semilinear set that can be effectively computed from its grammar. In this paper we study the computation of Parikh images for graph grammars defined by contextual hyperedge replacement (CHR). Our motivation is to generate effi...
متن کاملPerformance Analysis of Grappa Parsers for Hyperedge Replacement Grammars
This document reports on some experiments on the performance of graph parsers generated by Grappa.1 In particular, it compares the performance of PDT [1] and PSR [2] parsers with the more general, but — as it turns out – slower Cocke-Younger-Kasami-style parsers [4] generated by DiaGen.2 All experiments have been conducted on a MacBook Pro 2013, 2,7 GHz Intel Core i7, Java 1.8.0.
متن کاملSecond-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting s...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کامل